#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<math.h>
using namespace std;



class Solution {
public:
    vector<int> countPoints(vector<vector<int>>& points, vector<vector<int>>& queries) {
        //暴力
        vector<int> result;
        for(int i = 0;i<queries.size();++i){
            int temp = 0;
            for(int j = 0;j<points.size();++j){
                if(func(points[j],queries[i])){
                    ++temp;
                }
            }
            result.push_back(temp);
        }
        return result;

    }
    bool func(vector<int>& point ,vector<int>& querie){
        //判断某个点在不在这个圆内
        int temp = pow(point[0]-querie[0],2)+pow(point[1]-querie[1],2);
        if(temp<=pow(querie[2],2)){
            return true;
        } 
        return false;
    }
};

int main(){
    Solution S;
    vector<vector<int>> points = {{1,1},{2,2},{3,3},{4,4},{5,5}};
    vector<vector<int>> queries = {{1,2,2},{2,2,2},{4,3,2},{4,3,3}};
    vector<int> result = S.countPoints(points,queries);
    return 0;
}
